Nuprl Lemma : Rda-R-names 11,40

A:Realizer, x:Knd.
((Rplus?(A)))  ((Rnone?(A)))  (x  dom(Rda(A)))  (inl locknd(R-loc(A);x)   R-names(A)) 
latex


DefinitionsT, A c B, x:AB(x), rcv(l,tg), P  Q, i <z j, b, i j, nth_tl(n;as), hd(l), i  j < k, ||as||, {i..j}, l[i], {T}, SQType(T), P & Q, Top, , True, if b then t else f fi , Y, reduce(f;k;as), deq-member(eq;x;L), tt, ff, t.1, , xt(x), t  T, MaName, R-names(A), R-loc(R), Rda(R), x  dom(f), Rnone?(x1), Rplus?(x1), b, P  Q, Knd, x:AB(x), outl(x), t.2, isl(x), tag(k), isrcv(k), Dec(P), P  Q, P  Q, False, x(s), Unit, A, Realizer, locl(a), Rrframe(loc;x;L), Rbframe(loc;k;L), Raframe(loc;k;L), Rpre(loc;ds;a;p;P), Rsends(ds;knd;T;l;dt;g), Reffect(loc;ds;knd;T;x;f), Rsframe(lnk;tag;L), Rframe(loc;T;x;L), Rinit(loc;T;x;v), left  right, Rnone(), , fpf-domain(f)
Lemmaslnk-decl-dom2, squash wf, locknd functionality isrcv, member-remove-repeats, member-fpf-dom, pi1 wf, id-deq wf, lnk-decl-dom-implies, member map, remove-repeats wf, member append, fpf-join-dom2, es realizer wf, non neg length, length wf1, locl wf, fpf-trivial-subtype-top, lnk-decl wf, fpf-join wf, l member wf, decidable equal MaName, lsrc wf, rcv wf, ldst wf, append wf, cons member, fpf-single wf, fpf-dom wf, assert wf, top wf, length wf nat, fpf-domain wf, map wf, locknd wf, LocKnd wf, select member, Knd sq, Kind-deq wf, fpf-single-dom, false wf, true wf, not wf, bool wf, finite-prob-space wf, decl-type wf, decl-state wf, fpf wf, IdLnk wf, Knd wf, rationals wf, Id wf, unit wf

origin